On difference matrices and regular latin squares

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quarter-regular biembeddings of Latin squares

In this talk I will review the concept of the biembedding of two latin squares. Of particular interest will be the regular biemedding of two isomorphic copies of the latin square corresponding to the cyclic group of order n, denoted Cn. Grannell and Griggs have shown that, for all n, a regular biembedding exists, and in addition, that the automorphism group of the regular biembedding has order ...

متن کامل

Third-regular biembeddings of Latin squares

For each positive integer n ≥ 2, there is a well-known regular orientable Hamiltonian embedding of Kn,n, and this generates a regular face 2-colourable triangular embedding of Kn,n,n. In the case n ≡ 0 (mod 8), and only in this case, there is a second regular orientable Hamiltonian embedding of Kn,n. The current paper presents an analysis of the face 2-colourable triangular embedding of Kn,n,n ...

متن کامل

E-Clean Matrices and Unit-Regular Matrices

Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.

متن کامل

On Arc-Regular Permutation Groups Using Latin Squares

For a given a permutation group G, the problem of determining which regular digraphs admit G as an arc-regular group of automorphism is considered. Groups which admit such a representation can be characterized in terms of generating sets satisfying certain properties, and a procedure to manufacture such groups is presented. The technique is based on constructing appropriate factorizations of (s...

متن کامل

On Completing Latin Squares

We present a ( 2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1− 1 e due to Gomes, Regis, and Shmoys [5]. We also show that PLSE is APX-hard. We then consider two new and natural variants of PLSE. In the first, there is an added restriction that at most k colors are to be used in the extension; for this problem,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg

سال: 1980

ISSN: 0025-5858,1865-8784

DOI: 10.1007/bf02941430